Improved Approximation Algorithms for Budgeted Allocations
نویسندگان
چکیده
We provide a 3/2-approximation algorithm for an offline budgeted allocations problem with applications to sponsored search auctions. This an improvement over the e/(e−1) approximation of Andelman and Mansour [1] and the e/(e − 1) − approximation (for ≈ 0.0001) of Feige and Vondrak [2] for the more general Maximum Submodular Welfare (SMW) problem. For a special case of our problem, we improve this ratio to √ 2. We also show that the problem is APX-hard.
منابع مشابه
Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets
Traditional incentive-compatible auctions for selling multiple goods to unconstrained and budgeted bidders can discriminate between bidders by selling identical goods at different prices. For this reason, A recent study by Feldman et al. dropped incentive compatibility and turned the attention to revenue maximizing envy-free item-pricing allocations for budgeted bidders. Envy-free allocations w...
متن کاملBudgeted Allocations in the Full-Information Setting
We build on the work of Andelman & Mansour and Azar, Birnbaum, Karlin, Mathieu & Thach Nguyen to show that the fullinformation (i.e., offline) budgeted-allocation problem can be approximated to within 4/3: we conduct a rounding of the natural LP relaxation, for which our algorithm matches the known lower-bound on the integrality gap.
متن کاملCut Problems in Graphs with a Budget Constraint
We study budgeted variants of classical cut problems: the Multiway Cut problem, the Multicut problem, and the k-Cut problem, and provide approximation algorithms for these problems. Specifically, for the budgeted multiway cut and the k-cut problems we provide constant factor approximation algorithms. We show that the budgeted multicut problem is at least as hard to approximate as the sparsest c...
متن کاملAnalyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems
We study partial and budgeted versions of the well studied connected dominating set problem. In the partial connected dominating set problem (Pcds), we are given an undirected graph G = (V,E) and an integer n′, and the goal is to find a minimum subset of vertices that induces a connected subgraph of G and dominates at least n′ vertices. We obtain the first polynomial time algorithm with an O(ln...
متن کاملAn Improved Approximation Guarantee for the Maximum Budgeted Allocation Problem
We study the Maximum Budgeted Allocation problem, which is the problem of assigning indivisible items to players with budget constraints. In its most general form, an instance of the MBA problem might include many different prices for the same item among different players, and different budget constraints for every player. So far, the best approximation algorithms we know for the MBA problem ac...
متن کامل